SUBGRAPH WITH SET SIMILARITY IN ADATABASE
نویسندگان
چکیده
منابع مشابه
Efficient Subgraph Similarity All-Matching
Being a fundamental problem in managing graph data, subgraph exact all-matching enumerates all isomorphic matches of a query graph q in a large data graph G. The existing techniques focus on pruning non-promising data graph vertices against q. However, the reduction and sharing of intermediate matches have not received adequate attention. These two issues become more critical on subgraph simila...
متن کاملSubgraph Similarity Search in Large Graphs
One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their underlying graphs. These graphs are typically noisy and contain thousands of vertices and millions of edges. In many cases, the graphs are unlabeled and the notion of similarity is also not well defined. We study the p...
متن کاملAlgorithms for Graph Similarity and Subgraph Matching
We deal with two independent but related problems, those of graph similarity and subgraph matching, which are both important practical problems useful in several fields of science, engineering and data analysis. For the problem of graph similarity, we develop and test a new framework for solving the problem using belief propagation and related ideas. For the subgraph matching problem, we develo...
متن کاملDocument Clustering with Similarity Rough Set Model
Ho et al. proposed a tolerance rough set model (TRSM) for representing documents and successfully applied it to document clustering. In this paper we analyze their algorithm to point out its drawback. We introduce similarity rough set model (SRSM) as another model for presenting documents in document clustering. The model has been evaluated by experiments on test collection.
متن کاملOverlap Set Similarity Joins with Theoretical Guarantees
This paper studies the set similarity join problem with overlap constraints which, given two collections of sets and a constant c , �nds all the set pairs in the datasets that share at least c common elements. This is a fundamental operation in many �elds, such as information retrieval, data mining, and machine learning. The time complexity of all existing methods is O (n2) where n is the total...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asia-pacific Journal of Convergent Research Interchange
سال: 2017
ISSN: 2508-9080
DOI: 10.21742/apjcri.2017.06.04